Multi-formation track initiation method based on Density clustering
نویسندگان
چکیده
منابع مشابه
An improved method for density-based clustering
Knowledge discovery in large multimedia databases which usually contain large amounts of noise and high-dimensional feature vectors is an increasingly important research issue. Density-based clustering is proved to be much more efficient when dealing with such databases. However, its clustering quality mainly depends on the parameter setting. For the adequate choice of the parameters to be pres...
متن کاملA multi agent method for cell formation with uncertain situation, based on information theory
This paper assumes the cell formation problem as a distributed decision network. It proposes an approach based on application and extension of information theory concepts, in order to analyze informational complexity in an agent- based system, due to interdependence between agents. Based on this approach, new quantitative concepts and definitions are proposed in order to measure the amount of t...
متن کاملSelf-adaptive Trajectory Prediction Method Based on Density Clustering
To solve the problem of user trajectory prediction in the mobile communication environment, we proposed a self-adaptive trajectory prediction method (ATPDC) based on density clustering. And it consists of two stages which are trajectory modeling stage and trajectory updating stage respectively. In the first stage, it constructs the user trajectory prediction model by clustering historical traje...
متن کاملA Trajectory Data Clustering Method Based On Dynamic Grid Density
Under the traditional method of frequent trajectory mining, the location of data is obtained through the GPS device. However, limited equipment accuracy may incur location ambiguity. In this paper, we propose a new trajectory data clustering method based on dynamic grid density, in order to remove this ambiguity. In this method, the trajectory space of an object is firstly divided into equal-si...
متن کاملKDDClus: A Simple Method for Multi-Density Clustering
Automated clustering of multi-density spatial data is developed. The algorithm KDDClus serves as an enhancement to the wellknown DBSCAN. Averaging the distances of a pattern to all k of its nearest neighbours allows a smoothing out of noise while automatically detecting the “knees” from the k-distance plot. The use of the KD-tree data structure enables efficient computation of the k-nearest nei...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOP Conference Series: Earth and Environmental Science
سال: 2020
ISSN: 1755-1315
DOI: 10.1088/1755-1315/558/4/042053